翻訳と辞書
Words near each other
・ Admirandopora
・ Admiration
・ Admirał floty
・ Admire Formation
・ Admire Group
・ Admire Moon
・ Admire Rakti
・ Admire, Kansas
・ Admire, Pennsylvania
・ Admirável Chip Novo
・ Admirável Mundo Novo
・ Admissibility
・ Admissible algebra
・ Admissible decision rule
・ Admissible evidence
Admissible heuristic
・ Admissible numbering
・ Admissible ordinal
・ Admissible representation
・ Admissible rule
・ Admissible set
・ Admissible trading strategy
・ Admission
・ Admission (film)
・ Admission (law)
・ Admission by Guts
・ Admission control
・ Admission Day Monument
・ Admission Free
・ Admission note


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Admissible heuristic : ウィキペディア英語版
Admissible heuristic
In computer science, specifically in algorithms related to pathfinding, a heuristic function is said to be admissible if it never overestimates the cost of reaching the goal, i.e. the cost it estimates to reach the goal is not higher than the lowest possible cost from the current point in the path.
== Search algorithms ==
An admissible heuristic is used to estimate the cost of reaching the
goal state in an informed search algorithm. In order for a heuristic
to be admissible to the search problem, the estimated cost must always
be lower than or equal to the actual cost of reaching the goal state.
The search algorithm uses the admissible heuristic to find an estimated
optimal path to the goal state from the current node.
For example, in A
* search
the evaluation function (where
n is the current node) is:
f(n) = g(n) + h(n)
where
:f(n) = the evaluation function.
:g(n) = the cost from the start node to the current node
:h(n) = estimated cost from current node to goal.
h(n) is calculated using the heuristic
function. With a non-admissible heuristic, the A
* algorithm could
overlook the optimal solution to a search problem due to an
overestimation in f(n).

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Admissible heuristic」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.